منابع مشابه
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187
Addendum to “Choiceless polynomial time” Ann. Pure Appl. Logic 100 (1999) 141–187 Andreas Blassa ; ∗;1, Yuri Gurevichb Saharon Shelahc;d ; 2 aMathematics Department, University of Michigan, Ann Arbor, MI 48109–1109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA cMathematics Department, Hebrew University, Jerusalem 91904, Israel dMathematics Department, Rutgers University, N...
متن کاملErratum to "State-morphism MV-algebras" [Ann. Pure Appl. Logic 161 (2009) 161-173]
Recently, the first two authors characterized in Di Nola and Dvurečenskij (2009) [1] subdirectly irreducible state-morphism MV-algebras. Unfortunately, the main theorem (Theorem 5.4(ii)) has a gap in the proof of Claim 10, as the example below shows. We now present a correct characterization and its correct proof. © 2010 Elsevier B.V. All rights reserved.
متن کاملErratum to "On the reflection invariance of residuated chains" [Ann. Pure Appl. Logic 161 (2009) 220-227]
In Section 2 replace the definition of ∗◦Q in Definition 1 by x∗◦Q y = inf{u ∗◦ v | u > x, v > y}. It is defined only if the infimum exists. Proposition 1 remains unchanged. Theorem 0. Let (X, ∗◦,→∗◦,≤) be a commutative residuated semigroup on a complete chain equipped with the order topology. Let a, b, c ∈ X be such that a = b→∗◦ c. Let (x, y) ∈ X × X be such that 1. neither x nor y equals the...
متن کاملFactoring Pure Logic Programs
This paper describes a factoring algorithm that removes deep backtracking from logic programs that is in general applicable to a large subclass of well-moded logic programs. Originally developed for the pure logic programming language Elf [10], our results can also be applied to other logic programming languages, such as Prolog and -Prolog [9], as well. Further applications of factoring include...
متن کاملThe Pure Logic of Ground
I lay down a system of structural rules for various notions of ground and establish soundness and completeness. Ground is the relation of one truth holding in virtue of others. This relation is like that of consequence in that a necessary connection must hold between the relata if the relation is to obtain but it differs from consequence in so far as it required that there should also be an exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1997
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(97)00043-2